Order-distance and other metric-like functions on jointly distributed random variables

نویسندگان

  • Ehtibar N. Dzhafarov
  • Janne V. Kujala
چکیده

We construct a class of real-valued nonnegative binary functions on a set of jointly distributed random variables, which satisfy the triangle inequality and vanish at identical arguments (pseudo-quasi-metrics). We apply these functions to the problem of selective probabilistic causality encountered in behavioral sciences and in quantum physics. The problem reduces to that of ascertaining the existence of a joint distribution for a set of variables with known distributions of certain subsets of this set. Any violation of the triangle inequality by one of our functions when applied to such a set rules out the existence of the joint distribution. We focus on an especially versatile and widely applicable class of pseudo-quasi-metrics called order-distances. We show, in particular, that the Bell-CHSH-Fine inequalties of quantum physics follow from the triangle inequalities for appropriately defined order-distances. We show how certain metric-like functions on jointly distributed random variables (pseudo-quasimetrics introduced in Section 1) can be used in dealing with the problem of selective probabilistic causality (introduced in Section 2), illustrating this on examples taken from behavioral sciences and quantum physics (Section 3). Although most of Section 2 applies to arbitrary pseudo-quasimetrics on jointly distributed random variables, we single out one, termed order-distance, which is especially useful due to its versatility. We discuss examples of other pseudo-quasi-metrics and rules for their construction in Section 4. 1. Order p.q.-metrics Random variables in this paper are understood in the broadest sense, as measurable functions X : Vs → V , no restrictions being imposed on the sample spaces (Vs,Σs, μs) and the induced probability spaces, (V,Σ, μ), with the usual meaning of the terms (sets of values Vs, V , sigmaalgebras Σs,Σ, and probability measures μs, μ). In particular, any set X of jointly distributed random variables (functions on the same sample space) is a random variable, and its induced probability space (or, simply, distribution) X = (V,Σ, μ) is referred to as the joint distribution of its elements. Given a class of random variables X , not necessarily jointly distributed, let X ∗ be the class of distributions X for all X ∈ X . For any class function f∗ : X ∗ → R (reals), the function f : X → R defined by f (X) = f∗ ( X ) is called observable (as it does not depend on sample spaces, typically unobservable). We will conveniently confuse f and f∗ for observable functions, so that if 2000 Mathematics Subject Classification. Primary 60B99, Secondary 81Q99, 91E45.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Composite Kernel Optimization in Semi-Supervised Metric

Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...

متن کامل

Random coincidence point results for weakly increasing functions in partially ordered metric spaces

The aim of this paper is to establish random coincidence point results for weakly increasing random operators in the setting of ordered metric spaces by using generalized altering distance functions. Our results present random versions and extensions of some well-known results in the current literature.

متن کامل

Bounds for CDFs of Order Statistics Arising from INID Random Variables

In recent decades, studying order statistics arising from independent and not necessary identically distributed (INID) random variables has been a main concern for researchers. A cumulative distribution function (CDF) of these random variables (Fi:n) is a complex manipulating, long time consuming and a software-intensive tool that takes more and more times. Therefore, obtaining approximations a...

متن کامل

یادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیک‌های یادگیری معیار فاصله

Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...

متن کامل

On the Structure of Metric-like Spaces

The main purpose of this paper is to introduce several concepts of the metric-like spaces. For instance, we define concepts such as equal-like points, cluster points and completely separate points. Furthermore, this paper is an attempt to present compatibility definitions for the distance between a point and a subset of a metric-like space and also for the distance between two subsets of a metr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1110.1228  شماره 

صفحات  -

تاریخ انتشار 2011